Determinacy from strong reflection

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Determinacy from Strong Reflection

The Axiom of Determinacy holds in the inner model L(R) assuming Martin’s Maximum for partial orderings of size c.

متن کامل

Determinacy from Strong Compactness of Ω1

In the absence of the Axiom of Choice, the “small” cardinal ω1 can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say that ω1 is Xstrongly compact (where X is any set) if there is a fine, countably complete measure on ℘ω1(X). Working in ZF + DC, we prove that the ℘(ω1)-strong compact...

متن کامل

Determinacy in strong cardinal models

We give limits defined in terms of abstract pointclasses of the amount of determinacy available in certain canonical inner models involving strong cardinals. We show for example: Theorem A Det(Π1-IND)⇒there exists an inner model with a strong cardinal. Theorem B Det(AQI)⇒there exist type-1 mice and hence inner models with proper classes of strong cardinals where Π1-IND (AQI) is the pointclass o...

متن کامل

Determinacy and determinacy analysis

One attractive, unique feature of logic programming languages is their ability to succinctly and declaratively express search. The alternatives of a search can be speci ed by a set of clauses de ning the same predicate. By backtracking, considering in turn each of these clauses, the di erent alternatives are explored until a solution (if it exists) is found. However, though backtracking is esse...

متن کامل

Integrating Reflection, Strong Typing and Static Checking

We define and present the computational structure of linguistic reflection as the ability of a running program to generate new program fragments and to integrate these into its own execution. The integration of this kind of reflection with compiler based, strongly typed programming languages is described. This integration is accomplished in a manner that preserves strong typing and does not und...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 2013

ISSN: 0002-9947,1088-6850

DOI: 10.1090/s0002-9947-2013-06058-8